Chordal circulant graphs and induced matching number
نویسندگان
چکیده
منابع مشابه
Minimal Chordal Sense of Direction and Circulant Graphs
A sense of direction is an edge labeling on graphs that follows a globally consistent scheme and is known to considerably reduce the complexity of several distributed problems. In this paper, we study aparticular instance of sense of direction, called a chordal sense of direction (CSD). In special, we identify the class of k-regular graphs that admit a CSD with exactly k labels (a minimal CSD)....
متن کاملThe Zero Forcing Number of Circulant Graphs
The zero forcing number of a graph G is the cardinality of the smallest subset of the vertices of G that forces the entire graph using a color change rule. This paper presents some basic properties of circulant graphs and later investigates zero forcing numbers of circulant graphs of the form C[n, {s, t}], while also giving attention to propagation time for specific zero forcing sets.
متن کاملTotal-Chromatic Number and Chromatic Index of Dually Chordal Graphs
A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly chordal graphs and interval graphs. We prove that Vizing's total-colour conjecture holds for dually chordal graphs. We describe a new heuristi...
متن کاملThe augmented Zagreb index, vertex connectivity and matching number of graphs
Let $Gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. Denote by $Upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. In the classes of graphs $Gamma_{n,kappa}$ and $Upsilon_{n,beta}$, the elements having maximum augmented Zagreb index are determined.
متن کاملMaximum Vertex-weighted Matching in Strongly Chordal Graphs
Given a graph G = (V; E) and a real weight for each vertex of G, the vertex-weight of a matching is deened to be the sum of the weights of the vertices covered by the matching. In this paper we present a linear time algorithm for nding a maximum vertex-weighted matching in a strongly chordal graph, given a strong elimination ordering. The algorithm can be specialized to nd a maximum cardinality...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2020.111947